Comparing two evolutionary algorithm based methods for layout generation: Dense packing versus subdivision
نویسندگان
چکیده
منابع مشابه
Evolutionary Algorithm for Bin Packing Problem
In this paper we investigate the use of evolution strategy (ES) for the bin packing problem. We used (1, λ)-ES, where 10 children are generated from one parent by means of a simple genetic operators; the crossover is not applied. The best of the descendants becomes the new parent solution. A widely known ordering representation modified for the purposes of the grouping the objects was used in t...
متن کاملLayout driven FPGA packing algorithm for performance optimization
FPGA is a 2D array of configurable logic blocks. Packing is to pack logic elements into device specific configurable logic blocks for subsequent placement. The traditional fixed delay model of inter and intra cluster delays used in packing does not represent post-placement delays and often leads to sub-optimal solutions. This paper presents a new layout driven packing algorithm, named LDPack, b...
متن کاملan adapted harmony search based algorithm for facility layout optimization
this paper presents a strategy for using harmony search algorithm in facility layout optimization problems. in this paper an adapted harmony search algorithm is developed for solving facility layout optimization problems. this method finds an optimal facility arrangement in an existing layout. two real-world case studies are employed to demonstrate the efficiency of this model. a comparison is ...
متن کاملTwo-dimensional packing algorithms for layout of disconnected graphs
We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be used in the layout of disconnected objects in graph visualization. The parameters that affect the performance of these algorithms as well as the circumstances under which they pe...
متن کاملAn Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing
We consider the 3-stage two-dimensional bin packing problem, which occurs in real-world problems such as glass cutting. For it, we present a new integer linear programming formulation and a branch and price algorithm. Column generation is performed by applying either a greedy heuristic or an Evolutionary Algorithm (EA). Computational experiments show the benefits of the EA-based approach. The h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence for Engineering Design, Analysis and Manufacturing
سال: 2014
ISSN: 0890-0604,1469-1760
DOI: 10.1017/s0890060414000237